Position conflict detection and avoidance in a programmable graphics processor using tile coverage data

ABSTRACT

Prior to executing a program on a fragment, a conflict detection unit, within a fragment processor checks if there is a position conflict indicating a RAW (read after write) hazard may exist. A RAW hazard exists when there is a pending write to a destination location that source data will be read from during execution of the program. When the fragment enters a processing pipeline, each destination location that may be written during the processing of the fragment is entered in conflict detection unit. During processing, the conflict detection unit is updated when a pending write to a destination location is completed.

FIELD OF THE INVENTION

One or more aspects of the invention generally relate to processinggraphics data in a programmable graphics processor, and moreparticularly to writing and reading graphics data associated with abuffer.

BACKGROUND

Current graphics data processing is exemplified by systems and methodsdeveloped to perform a specific operation on several graphics dataelements, e.g., linear interpolation, tessellation, texture mapping,depth testing. Traditionally graphics processing systems wereimplemented as fixed function computation units and more recently thecomputation units are programmable to perform a limited set ofoperations. Computation units are connected in a “shading pipeline” toperform shading operations. The shading pipeline includes a texture readinterface for reading texture data from graphics memory and a writeinterface for writing graphics data, including texture data to graphicsmemory. When the texture data is being written to a buffer stored ingraphics memory, the buffer may not be read from by the texture readinterface until the shading pipeline has been flushed. The shadingpipeline is flushed to assure that any pending writes to the buffer arecompleted before the texture data is read from the buffer by the shadingpipeline. Processing throughput of the shading pipeline is reducedwhenever a flush instruction is executed.

For the foregoing reasons, it is desirable to write to a buffer and readfrom the buffer without flushing the shading pipeline between the writeand read.

SUMMARY

Various embodiments of a method of the invention include partitioning animage into tiles, each tile associated with a unique tile origin,allocating an entry in at least one storage resource to a tile origin,the entry specified by a tile number, and storing a portion of aposition associated with at least one fragment in the entry.

Various embodiments of the invention include a conflict detection unitconfigured to detect position conflicts. The conflict detection unitincludes at least one storage resource including entries configured tostore tile origins and coverage mask data and a control unit configuredto determine whether or not a position conflict exists within a tileassociated with a tile origin stored in the at least one storageresource.

BRIEF DESCRIPTION OF THE VARIOUS VIEWS OF THE DRAWINGS

Accompanying drawing(s) show exemplary embodiment(s) in accordance withone or more aspects of the present invention; however, the accompanyingdrawing(s) should not be taken to limit the present invention to theembodiment(s) shown, but are for explanation and understanding only.

FIG. 1A is a block diagram of an exemplary embodiment of a respectivecomputer system in accordance with one or more aspects of the presentinvention including a host computer and a graphics subsystem.

FIG. 1B is a block diagram of an exemplary embodiment of portions ofFragment Processing Pipeline of FIG. 1A in accordance with one or moreaspects of the present invention.

FIGS. 2A, 2B, and 2C illustrate embodiments of methods in accordancewith one or more aspects of the present invention.

FIG. 3A is a conceptual diagram of a buffer used by a display device.

FIG. 3B is a conceptual diagram of buffers stored in graphics memory.

FIGS. 4A and 4B illustrate embodiments of methods in accordance with oneor more aspects of the present invention.

FIG. 5 is a block diagram of an exemplary embodiment of portions ofFragment Processing Pipeline of FIG. 1A in accordance with one or moreaspects of the present invention.

FIGS. 6A and 6B illustrate embodiments of methods of processingfragments in accordance with one or more aspects of the presentinvention.

FIG. 7 is a block diagram of an exemplary embodiment of a portion of theConflict Detection Unit of FIG. 1B or FIG. 5 in accordance with one ormore aspects of the present invention.

FIG. 8A illustrates a display partitioned into tiles in accordance withone or more aspects of the present invention.

FIG. 8B is a block diagram of one embodiment of the Conflict DetectionUnit of FIG. 1B or FIG. 5 in accordance with one or more aspects thepresent invention.

FIG. 8C illustrates a method for detecting position conflicts duringfragment processing, in accordance with one embodiment of the presentinvention.

FIG. 9A is a block diagram of one embodiment of the Conflict DetectionUnit of FIG. 1B or FIG. 5 in accordance with one or more aspects thepresent invention.

FIG. 9B illustrates a method for detecting position conflicts duringfragment processing, in accordance with one embodiment of the presentinvention.

FIGS. 10A, 10B, 10C, and 10D illustrate embodiments of methods ofprocessing fragment program instructions in accordance with one or moreaspects of the present invention.

FIG. 11A illustrates an embodiment of a method of depth buffering priorto shading graphics data in accordance with one or more aspects of thepresent invention.

FIGS. 11B and 11C illustrate embodiments of methods of depth peeling inaccordance with one or more aspects of the present invention.

FIG. 12A is a block diagram of an exemplary embodiment of a respectivecomputer system in accordance with one or more aspects of the presentinvention including a host computer and a graphics subsystem.

FIGS. 12B and 12C are block diagrams of exemplary embodiments of theProgrammable Graphics Processing Pipeline of FIG. 12A in accordance withone or more aspects of the present invention.

DISCLOSURE OF THE INVENTION

The current invention involves new systems and methods for processinggraphics data elements using position conflict detection and avoidancein a programmable graphics processor.

FIG. 1A is a block diagram of an exemplary embodiment of a ComputingSystem generally designated 100 and including a Host Computer 110 and aGraphics Subsystem 107. Computing System 100 may be a desktop computer,server, laptop computer, palm-sized computer, tablet computer, gameconsole, cellular telephone, computer-based simulator, or the like. Hostcomputer 110 includes Host Processor 114 that may include a systemmemory controller to interface directly to Host Memory 112 or maycommunicate with Host Memory 112 through a System Interface 115. SystemInterface 115 may be an I/O (input/output) interface or a bridge deviceincluding the system memory controller to interface directly to HostMemory 112. Examples of System Interface 115 known in the art includeIntel® Northbridge and Intel® Southbridge.

Host computer 110 communicates with Graphics Subsystem 107 via SystemInterface 115 and a Graphics Interface 117. Graphics Subsystem 107includes a Local Memory 140 and a Programmable Graphics Processor 105.Programmable Graphics Processor 105 uses memory to store graphics dataand program instructions, where graphics data is any data that is inputto or output from computation units within Programmable GraphicsProcessor 105. Graphics memory is any memory used to store graphics dataor program instructions to be executed by Programmable GraphicsProcessor 105. Graphics memory may include portions of Host Memory 112,Local Memory 140 directly coupled to Programmable Graphics Processor105, register files coupled to the computation units within ProgrammableGraphics Processor 105, and the like.

In addition to Graphics Interface 117, Programmable Graphics Processor105 includes a Graphics Processing Pipeline 103, a Memory Controller 120and an Output Controller 180. Data and program instructions received atGraphics Interface 117 can be passed to a Geometry Processor 130 withinGraphics Processing Pipeline 103 or written to Local Memory 140 throughMemory Controller 120. Memory Controller 120 includes read interfacesand write interfaces that each generate address and control signals toLocal Memory 140, storage resources, and Graphics Interface 117. Storageresources may include register files, caches, FIFO (first in first out)memories, and the like. In addition to communicating with Local Memory140, and Graphics Interface 117, Memory Controller 120 also communicateswith Graphics Processing Pipeline 103 and Output Controller 180 throughread and write interfaces in Graphics Processing Pipeline 103 and a readinterface in Output Controller 180. The read and write interfaces inGraphics Processing Pipeline 103 and the read interface in OutputController 180 generate address and control signals to Memory Controller120.

Within Graphics Processing Pipeline 105, Geometry Processor 130 and aprogrammable graphics fragment processing pipeline, Fragment ProcessingPipeline 160, perform a variety of computational functions. Some ofthese functions are table lookup, scalar and vector addition,multiplication, division, coordinate-system mapping, calculation ofvector normals, tessellation, calculation of derivatives, interpolation,and the like. Geometry Processor 130 and Fragment Processing Pipeline160 are optionally configured such that data processing operations areperformed in multiple passes through Graphics Processing Pipeline 103 orin multiple passes through Fragment Processing Pipeline 160. Each passthrough Programmable Graphics Processor 105, Graphics ProcessingPipeline 103 or Fragment Processing Pipeline 160 concludes with optionalprocessing by a Raster Operation Unit 165. Data produced in a passthrough Programmable Graphics Processor 105, Graphics ProcessingPipeline 103 or Fragment Processing Pipeline 160 may be written to abuffer in graphics memory to be read from during a subsequent pass.

Vertex programs are sequences of vertex program instructions compiled byHost Processor 114 for execution within Geometry Processor 130 andRasterizer 150. Fragment programs are sequences of fragment programinstructions compiled by Host Processor 114 for execution withinFragment Processing Pipeline 160. Graphics Processing Pipeline 103receives a stream of program instructions (vertex program instructionsand fragment program instructions) and data from Graphics Interface 117or Memory Controller 120, and performs vector floating-point operationsor other processing operations using the data. The program instructionsconfigure subunits within Geometry Processor 130, Rasterizer 150 andFragment Processing Pipeline 160. The program instructions and data arestored in graphics memory. When a portion of Host Memory 112 is used tostore program instructions and data, the portion of Host Memory 112 canbe uncached so as to increase performance of access by ProgrammableGraphics Processor 105. Alternatively, configuration information iswritten to registers within Geometry Processor 130, Rasterizer 150 andFragment Processing Pipeline 160 using program instructions, encodedwith the data, or the like.

Data processed by Geometry Processor 130 and program instructions arepassed from Geometry Processor 130 to a Rasterizer 150. Rasterizer 150is a sampling unit that processes graphics primitives and generatessub-primitive data, such as pixel data or fragment data, includingcoverage data. Coverage data indicates which sub-pixel sample positionswithin a pixel are “covered” by a fragment formed by the intersection ofthe pixel and a primitive. Graphics primitives include geometry, such aspoints, lines, triangles, quadrilaterals, meshes, surfaces, and thelike. Rasterizer 150 converts graphics primitives into sub-primitivedata, performing scan conversion on the data processed by GeometryProcessor 130. Rasterizer 150 outputs fragment data and fragment programinstructions to Fragment Processing Pipeline 160.

The fragment programs configure the Fragment Processing Pipeline 160 toprocess fragment data by specifying computations and computationprecision. A Fragment Processor 155 optionally is configured by fragmentprogram instructions such that fragment data processing operations areperformed in multiple internal passes within Fragment Processor 155.Fragment Processor 155 outputs processed fragment data and codewordsgenerated from fragment program instructions to Raster Operation Unit165. Raster Operation Unit 165 includes a read interface and a writeinterface to Memory Controller 120 through which Raster Operation Unit165 accesses data stored in one or more buffers in Local Memory 140 orHost Memory 112. Raster Operation Unit 165 optionally performs near andfar plane clipping and raster operations, such as stencil, z test,blending, and the like, using fragment data read from the one or morebuffers in Local Memory 140 or Host Memory 112 at the x,y positionassociated with the fragment data and the processed fragment data toproduce output data. The output data from Raster Operation Unit 165 iswritten back to Local Memory 140 or Host Memory 112 at the x,y positionassociated with the output data.

In various embodiments Memory Controller 120, Local Memory 140, andGeometry Processor 130 are configured such that data generated atvarious points along Graphics Processing Pipeline 103 may be output viaRaster Operation Unit 165 and provided to Geometry Processor 130 orFragment Processor 155 as input. The output data is represented in oneor more formats as specified by the codewords. For example, color datamay be written as 16, 32, 64, or 128 bits per pixel fixed orfloating-point RGBA (red, green, blue, and alpha) to be scanned out fordisplay. As a specific example, four 16-bit floating-point components(RGBA) are combined forming 64 bits of color data for each fragment. Theoutput data, e.g., color, depth, and other parameters, may be processedaccording to a fragment program and stored in a buffer in graphicsmemory to be used as a texture map, e.g., shadow map, height field,stencil, and the like, by the fragment program. Alternatively, color anddepth output data may be written to a buffer, and later read andprocessed by Raster Operation Unit 165 to generate the final pixel dataprior to being scanned out for display via Output Controller 180.

For example, Fragment Processing Pipeline 160 is configured by fragmentprogram instructions to produce processed data and store the processeddata in a buffer in Local Memory 140. The Fragment Processing Pipeline160 is configured by the fragment program instructions to read andfurther process the processed data. For example, Fragment ProcessingPipeline 160 may be configured to implement a modified depth bufferalgorithm, e.g., sorting and maintaining more than one depth value foreach pixel. A modified depth buffer algorithm may be used to implementcorrect transparency by rendering fragments in back to front order whileapplying transparency blending.

Conventionally, a shading pipeline, such as Fragment Processing Pipeline160, is flushed (using a flush instruction) prior to executing fragmentprogram instructions that read the shadow map to avoid anyread-after-write (RAW) conflicts. A RAW conflict exists when a write toan (x,y) position within a buffer is pending when a read from the same(x,y) position in the buffer is received. The RAW conflict is removedwhen the write to the (x,y) position within the buffer is completed. Invarious embodiments of Fragment Processing Pipeline 160 in accordancewith one or more aspects of the present invention Fragment ProcessingPipeline 160, a flush is not needed between writing a buffer and readingthe buffer as an input to a Fragment Processor 155, as described furtherherein.

When processing is completed, an Output 185 of Graphics Subsystem 107 isprovided using Output Controller 180. Alternatively, Host Processor 114reads the composited frame, e.g., buffer, stored in Local Memory 140through Memory Controller 120, Graphics Interface 117 and SystemInterface 115. Output Controller 180 is optionally configured byopcodes, received from Graphics Processing Pipeline 103 via MemoryController 120, to deliver data to a display device, network, electroniccontrol system, other Computing System 100, other Graphics Subsystem110, or the like.

FIG. 1B is a block diagram of an exemplary embodiment of portions ofFragment Processing Pipeline 160 in accordance with one or more aspectsof the present invention. A Conflict Detection Unit 152 receivesfragment data and fragment program instructions from Rasterizer 150. Inan alternate embodiment, Conflict Detection Unit 152 is included withinRasterizer 150. In a further alternate embodiment, Conflict DetectionUnit 152 is included within Fragment Processor 155. Conflict DetectionUnit 152 determines if a RAW conflict exists for each source read of aposition in a buffer, as described further herein. Conflict DetectionUnit 152 blocks processing of one or more fragments when the positionconflict status indicates that a conflict exists. Conflict DetectionUnit 152 outputs the fragment program instructions to Fragment Processor155. Conflict Detection Unit 152 outputs fragment data for whichconflicts do not exist to Fragment Processor 155. The fragment data isprocessed by Fragment Processor 155 according to the fragment programinstructions. A Texture Unit 154, within Fragment Processor 155,receives the fragment data and fragment program instructions output byConflict Detection Unit 152. A Read Interface 153, within Texture Unit154, reads additional fragment program instructions and buffer data(texture map, height field, bump map, shadow map, jitter values, and thelike) from Local Memory 140 or Host Memory 112, via Memory Controller120. The buffer data stored in graphics memory may be generated byProgrammable Graphics Processor 105, by Host Processor 114, by anotherdevice, by a human, or the like.

Memory Controller 120 outputs the buffer data and the additionalfragment program instructions to Read Interface 153. Texture Unit 154outputs the buffer data, processed fragment data, and the additionalfragment program instructions to a Fragment Processing Unit 156.Fragment Processing Unit 156 processes the processed buffer data andprocessed fragment data as specified by the additional fragment programinstructions and outputs shaded fragment data, e.g., x, y, color, depth,configuration control, other parameters, to Raster Operation Unit 165.In some embodiments Fragment Processing Unit 156 is configured toprocess at least two fragments in parallel. Likewise, Conflict DetectionUnit 152 and Read Interface 153 may also be configured to process atleast two fragments in parallel. Raster Operation Unit 165 optionallyprocesses the shaded fragment data according to the configurationcontrol. A Write Interface 157 within Raster Operation Unit 165 writesthe optionally processed shaded fragment data to a buffer stored inLocal Memory 140 or Host Memory 112, via Memory Controller 120. WriteInterface 157 also outputs write position information to ConflictDetection Unit 152 to update the status of position conflicts, asdescribed further herein.

FIGS. 2A, 2B, and 2C illustrate embodiments of methods of detecting andavoiding position conflicts in accordance with one or more aspects ofthe present invention. FIG. 2A illustrates an embodiment of a method ofdetecting and avoiding RAW position conflicts during fragment shading.In step 201 Fragment Processing Pipeline 160 receives a first fragmentassociated with a position within a buffer. In step 205 FragmentProcessing Pipeline 160 begins shading the first fragment as specifiedby a fragment program, producing a shaded first fragment, and outputsthe shaded first fragment to Raster Operation Unit 165. Persons skilledin the art will recognize that depending on the complexity of thefragment program or the depth of a shading pipeline, several clockscycles, even hundreds of clock cycles may pass before the shaded firstfragment is produced. In step 207 Fragment Processing Pipeline 160receives a second fragment associated with the position within thebuffer. To produce a shaded second fragment, the fragment programspecifies reading the shaded first fragment as source data.

In step 209 Conflict Detection Unit 152 determines if a RAW positionconflict exists for the position associated with the second fragment,and, if so, in step 211 Conflict Detection Unit 152 locks processing ofthe second fragment. Locking a fragment prevents any processing of thefragment requiring source data that is not yet available due to a RAWposition conflict. In step 214 Raster Operation Unit 165 writes theshaded first fragment to the position in the buffer stored in graphicsmemory. Step 214 may be completed several, even hundreds of clock cyclesafter step 205. Raster Operation Unit 165 outputs the write positioninformation to Fragment Processor 155 confirming that the write iscomplete. In one embodiment the write is considered complete when thewrite request is output from Memory Controller 120 to Local Memory 140or to Host Memory 112 via Graphics Interface 117. In another embodimentthe write is considered complete when the write request is output fromRaster Operation Unit 165 to Memory Controller 120. In step 217 FragmentProcessing Pipeline 160 unlocks the second fragment and proceeds to step220. In step 220 Fragment Processor 155 begins shading the secondfragment as specified by the shader.

If, in step 209 Conflict Detection Unit 152 determines a RAW positionconflict does not exist for the position associated with the secondfragment, then in step 220 Fragment Processor 155 begins shading thesecond fragment as specified by the fragment program producing a shadedsecond fragment. In step 222 Fragment Processor 155 receives one or moreadditional fragments, each fragment associated with a position for whicha RAW position conflict does not exist. Fragment Processor 155 shadesthe one or more additional fragments. In step 214 Raster Operation Unit165 writes the shaded first fragment to the position in the bufferstored in graphics memory and outputs the write position information toConflict Detection Unit 152 confirming that the write is complete.

After shading the second fragment, Fragment Processor 155 outputs theshaded second fragment to Raster Operation Unit 165. The number of clockcycles from step 220 to when the shaded second fragment is output byFragment Processor 155 to Raster Operation Unit 165 may depend on thecomplexity of the shading program or the number of pipeline stages inFragment Processor 155. In an alternate embodiment, step 214 iscompleted before step 222. In a further alternate embodiment FragmentProcessing Pipeline 160 does not receive the one or more additionalfragments and step 222 is omitted.

FIG. 2B illustrates an embodiment of a method of detecting and avoidingRAW position conflicts during fragment shading including the stepsillustrated in FIG. 2A. In step 201 Fragment Processing Pipeline 160receives a first fragment associated with a position within a buffer.The fragment program specifies writing a shaded first fragment to theposition within the buffer. In step 203 Conflict Detection Unit 152receives the position. In one embodiment the position is represented asa pair of coordinates, e.g., (x,y), (s,t), (u,v), and the like, and thecoordinates or portions of the coordinates are stored in ConflictDetection Unit 152. The coordinates may be represented relative to abuffer or relative to a display. Coordinates represented within a buffermay be converted into coordinates within a display, e.g., screencoordinates, by applying coordinate offsets based on a position of thebuffer within the display. In another embodiment the position isrepresented as an address for a location in graphics memory. In yetanother embodiment the position includes a buffer identifier specifyingwhich of several buffers the position is associated with. In stillanother embodiment, Conflict Detection Unit 152 identifies a regionincluding the location and stores data, e.g. one or more bits,corresponding to the region. A region may represent several positions,where the positions may correspond to a region of an image, a region ofan output buffer, a sequence of physical memory addresses in graphicsmemory, or the like. Conflict Detection Unit 152 may store data forseveral regions, depending on a predetermined resolution of thepositions to be tracked.

In step 205 Fragment Processor 155 begins shading the first fragment, asspecified by the fragment program producing a shaded first fragment,several cycles or more later. The shaded first fragment is output toRaster Operation Unit 165. In step 207 Fragment Processing Pipeline 160receives a second fragment associated with the position within thebuffer. To produce a shaded second fragment, the fragment programspecifies reading the shaded first fragment as source data.

In step 209 Conflict Detection Unit 152 determines if a RAW positionconflict exists for the position associated with the second fragment,and, if so, then in step 211 Conflict Detection Unit 152 locksprocessing of the second fragment. In step 214 Raster Operation Unit 165writes the shaded first fragment to the position in the buffer stored ingraphics memory. Raster Operation Unit 165 outputs the write positioninformation to Conflict Detection Unit 152 confirming that the write iscomplete. In step 215 the position is removed from Conflict DetectionUnit 152, thereby updating the status of the position conflict.

In step 217 Conflict Detection Unit 152 unlocks the second fragment andin step 218 Conflict Detection Unit 152 determines if the fragmentprogram specifies writing the shaded second fragment to the positionwithin the buffer. If the fragment program specifies writing the shadedsecond fragment to the position within the buffer then, in step 219 theposition is entered in Conflict Detection Unit 152 and the secondfragment is output to Fragment Processor 155. In step 220 FragmentProcessor 155 begins shading the second fragment as specified by thefragment program, producing a shaded second fragment several or moreclock cycles later. The shaded second fragment is output by FragmentProcessor 155 to Raster Operation Unit 165.

If, in step 209 Conflict Detection Unit 152 determines a RAW positionconflict does not exist for the position associated with the secondfragment, then in step 218 Conflict Detection Unit 152 determines if thefragment program specifies writing the shaded second fragment to theposition within the buffer. If the fragment program specifies writingthe shaded second fragment to the position within the buffer then, instep 219 the position is entered in Conflict Detection Unit 152 and thesecond fragment is output to Fragment Processor 155. In step 220Fragment Processor 155 begins shading the second fragment as specifiedby the fragment program, producing a shaded second fragment several ormore clock cycles later. Steps 222 and 214 proceed as previouslydescribed in relation to FIG. 2A and in step 215 the first position isremoved from Conflict Detection Unit 152.

FIG. 2C illustrates an embodiment of a method of detecting and avoidingRAW position conflicts during fragment shading including the stepsillustrated in FIGS. 2A and 2B. In this embodiment, a third fragmentbypasses the locked second fragment and is shaded before the secondfragment is shaded. Steps 201, 203, 205, 207, 209, 211, 218, 219 and 220are completed as described in relation to FIG. 2B. In step 212(following step 211) Fragment Processor 155 receives a third fragmentassociated with another position within the buffer. In step 213 FragmentProcessor begins shading the third fragment as specified by the fragmentprogram. The number of clock cycles from step 213 to when a shaded thirdfragment is output by Fragment Processor 155 to Raster Operation Unit165 may depend on the complexity of the shading program or the number ofpipeline stages in Fragment Processor 155. Steps 214, 215, and 217proceed as described in relation to FIG. 2B.

If, in step 209 Conflict Detection Unit 152 determines a RAW positionconflict does not exist for the position associated with the secondfragment, then in step 218 Conflict Detection Unit 152 determines if thefragment program specifies writing the shaded second fragment to theposition within the buffer. If the fragment program specifies writingthe shaded second fragment to the position within the buffer then, instep 219 the position is entered in Conflict Detection Unit 152 and thesecond fragment is output to Fragment Processor 155. In step 220Fragment Processor 155 begins shading the second fragment as specifiedby the fragment program, producing a shaded second fragment several ormore clock cycles later. Steps 212 and 213 proceed as previouslydescribed. Steps 222 and 214 proceed as previously described in relationto FIG. 2A and in step 215 the first position is removed from ConflictDetection Unit 152.

FIG. 3A is a conceptual diagram of a Buffer 320 displayed by a displaydevice, e.g., monitor, projector, and the like. Data stored in Buffer320 is displayed on Display 330. Additional buffers of arbitrary sizesmay be displayed on Display 330. Each buffer may be positioned fordisplay relative to Display 330. A Pixel 340 within Buffer 320 isassociated with an x,y position relative to Display 330. In an alternateembodiment the x,y origin is in the lower left corner of Display 330.

FIG. 3B illustrates a Portion of Graphics Memory 350 including locationsstoring data for Buffer 320. Locations within a Section 360 store datafor Buffer 320. For example, a Location 366 stores data associated withPixel 340, e.g., color, depth, stencil, shadow depth, and the like. AnAddress 364 is used to access the Location 366. Address 364 may becomputed based on an x,y position and a base address corresponding to afirst location within Section 360. In an alternate embodiment Address364 is computed based on a position within Buffer 320 and an addressoffset within Portion of Graphics Memory 350 corresponding to Section360. A Section 370 includes locations storing data for another buffer.Each buffer is associated with a unique buffer identifier that may beused to determine a corresponding base address.

FIG. 4A illustrates a method of processing graphics data (fragments) inaccordance with one or more aspects of the present invention. Fragmentsare not necessarily processed in the order in which the fragments arereceived, specifically when a position conflict exists since one or morefragments for which conflicts do not exist may bypass one or morefragments for which conflicts do exist. However, fragment order for eachx,y position is maintained, i.e. a fragment associated with one x,yposition may bypass a fragment associated with another x,y position. Instep 401 fragments are received by Fragment Processing Pipeline 160. Afragment is associated with a specific location in a buffer to be read.Other fragments may be associated with either, the specific location inthe buffer, other locations in the buffer, or locations in anotherbuffer. In step 403 the location in the buffer associated with thefragment is tracked using Conflict Detection Unit 152, as describedfurther herein. Conflict Detection Unit 152 determines that a write tothe location in the buffer is pending. In step 405 at least a portion ofthe fragments are shaded by Fragment Processing Unit 156 as specified bya fragment program, producing shaded fragment data. In step 409 theshaded fragment data is output by Fragment Processor 155 to RasterOperation Unit 165.

In step 411 Conflict Detection Unit 152 determines if the write to thelocation in the buffer is still pending, and, if so, in step 413Conflict Detection Unit 152 waits for the write to the location in thebuffer to be completed. When the write is no longer pending, i.e., whenthe write is completed, Conflict Detection Unit 152 proceeds to step417. In step 413, if additional fragments or fragments remaining afterat least a portion of the fragments are shaded in step 405 are availablefor shading without position conflicts, those additional fragments orfragments remaining are output by Conflict Detection Unit 152 toFragment Processor 155 and are shaded by Fragment Processing Unit 156.

If, in step 411, the write to the location in the buffer is not pending,Conflict Detection Unit 152 proceeds to step 417. The write to thelocation in the buffer may be completed when either the shaded fragmentdata output by Fragment Processor 155 to Raster Operation Unit 165 instep 409 is written or when other shaded fragment data (produced usingother fragments received prior to the fragments received in step 401) iswritten to the location in the buffer.

In step 417 Read Interface 153 reads data stored in the location in thebuffer. In step 419 the fragment associated with the location in thebuffer is shaded by Fragment Processing Unit 156 as specified by thefragment program, producing additional shaded fragment data. In step 421the additional shaded fragment data is output by Fragment Processor 155to Raster Operation Unit 165.

FIG. 4B illustrates a method of processing graphics data including someof the steps shown in FIG. 4A. A fragment program specifies writing datato a location in a buffer to process a first fragment and reading thedata from the location in the buffer to produce shaded fragment data fora second fragment without an intervening flush of Fragment Processor 155or Fragment Processing Pipeline 160.

In step 401 fragments are received by Fragment Processing Pipeline 160.In step 402 the location in the buffer to be written by the firstfragment is entered in Conflict Detection Unit 152 (CDU). The secondfragment is also associated with the location in the buffer,specifically the fragment program specifies using data read from thelocation (source data) to produce a shaded second fragment. ConflictDetection Unit 152 determines that a write to the location in the bufferis pending and does not initiate reading the location in the buffer.Steps 405, 409, 411, and 413 are completed as previously described inrelation to FIG. 4A.

Following step 411 or step 413, Conflict Detection Unit 152 proceeds tostep 416. In step 416 Raster Operation Unit outputs write positioninformation to Conflict Detection Unit 152 to update the status of theposition conflict, i.e., removing the location from Conflict DetectionUnit 152. Steps 417, 419, and 421 proceed as described in regard to FIG.4A.

FIG. 5 is a block diagram of an exemplary embodiment of portions ofFragment Processing Pipeline 160, including a Data Cache 158. Fragmentdata received by Fragment Processing Pipeline 160 from Rasterizer 150 isprocessed according to the fragment program instructions and ConflictDetection Unit 152 determines if a RAW conflict exists for eachfragment. Conflict Detection Unit 152 outputs fragment data and thefragment program instructions to Fragment Processor 155. A ReadInterface 153 within Texture Unit 154 reads additional fragment programinstructions and buffer data from Data Cache 158. When the additionalfragment program instructions or the buffer data are not available inData Cache 158, i.e., there is a “cache miss”, the additional fragmentprogram instructions or the buffer data is read from either Local Memory140 or Host Memory 112, via Memory Controller 120 and optionally storedin Data Cache 158 and output by Read Interface 153. When a location isentered in Conflict Detection Unit 152 for a pending write, ConflictDetection Unit 152 determines if data stored in the location isavailable in an entry in Data Cache 158 and if so, invalidates the entryin Data Cache 158 as described further herein. In an alternateembodiment, entries in Data Cache 158 containing data read from alocation that is entered in Conflict Detection Unit 152 are invalidatedby Read Interface 153.

Texture Unit 154 outputs the texture map data, processed fragment data,and the additional program instructions to a Fragment Processing Unit156. Fragment Processing Unit 156 stores the buffer data in a Register159 to be used as source data. Fragment Processing Unit 156 processesthe processed map data and processed fragment data as specified by theadditional fragment program instructions and outputs shaded fragmentdata, e.g., x, y, color, depth, configuration control, other parameters,to Raster Operation Unit 165. Raster Operation Unit 165 optionallyprocesses the shaded fragment data according to the configurationcontrol. A Write Interface 157 within Raster Operation Unit 165 writesthe optionally-processed shaded fragment data to a buffer stored inLocal Memory 140 or Host Memory 112, via Memory Controller 120. WriteInterface 157 also outputs write position information to ConflictDetection Unit 152 to update the status of position conflicts. WriteInterface 157 outputs the position information and processed shadedfragment data to Data Cache 158 to update the entry.

The entry in Data Cache 158 may have been allocated to store dataassociated with another location in which case Data Cache may store theprocessed shaded fragment data in the next available entry. In analternate embodiment Write Interface 157 does not output the processedshaded fragment data to Data Cache 158, and Data Cache 158 instead readsthe processed shaded fragment data from the buffer. In another alternateembodiment the write position information includes a buffer identifierand Data Cache 158 stores data for more than one buffer.

FIG. 6A illustrates a method of processing fragments in FragmentProcessing Pipeline 160. In step 601 Conflict Detection Unit 152receives a fragment. In step 605, Conflict Detection Unit 152 determinesif processing the fragment as specified by a fragment program requires aread of source data, and, if not, Conflict Detection Unit 152 proceedsto step 621. If, in step 605, Conflict Detection Unit 152 determinesthat the fragment program specifies a read, in step 607 ConflictDetection Unit 152 determines if there is a position conflict with thelocation to be read (source location). If, in step 607 ConflictDetection Unit 152 determines there is a position conflict, ConflictDetection Unit 152 remains in step 607 and processing of the fragmentdoes not continue until the conflict does not exist. The conflict doesnot exist when a pending write to the location is completed.

If, in step 607, Conflict Detection Unit 152 determines there is not aposition conflict, then in step 608 Conflict Detection Unit 152 stores adestination location and outputs the fragment to Fragment Processor 155.A destination location may be an x,y position, an address correspondingto a memory location, a register address, or the like. The destinationposition is stored because there is an implied write for each fragmentbeing processed. However a processed fragment may not be written to adestination position if the processed fragment fails a depth or stenciltest as determined by Raster Operation Unit 165. In step 613 ReadInterface 153 reads the source location in graphics memory to obtainbuffer data and outputs the buffer data. If, in step 605, ConflictDetection Unit 152 determines that the fragment program does not specifya read, in step 623 Conflict Detection Unit 152 stores the position tobe written (destination location) in Conflict Detection Unit 152 andoutputs the fragment to Fragment Processor 155.

In step 629 Texture Unit 154 outputs the fragment and any source data,read from the source location in step 613, to Fragment Processing Unit156 for processing as specified by the fragment program. In step 631Fragment Processing Unit 156 outputs shaded data and configurationcontrol to Raster Operation Unit 165. Raster Operation Unit 165processes the shaded data and Write Interface 157 and optionally outputsthe processed shaded data to Memory Controller 120 with a write requestto the destination location. Write Interface 157 also outputs a writeupdate to Conflict Detection Unit 152. The write update is output toConflict Detection Unit 152 even when the processed shaded data is notwritten to the destination location because it failed a depth or stenciltest. In step 633 Conflict Detection Unit 152 unstores the position, asdescribed further herein.

FIG. 6B illustrates a method of processing fragments in FragmentProcessor 155 including Data Cache 158. Steps 601, 605, and 607 arecompleted as described in regard to FIG. 6A. In step 608 ConflictDetection Unit 152 stores a destination location and outputs thefragment and destination location to Fragment Processor 155. In step 609Read Interface 153 outputs the read request to Data Cache 158 and DataCache 158 determines if the location to be read is available in an entrywithin Data Cache 158, and, if not proceeds to step 613. If, in step609, Data Cache 158 determines buffer data stored in the location to beread is available in an entry, in step 611, Data Cache 158 determines ifthe entry is “dirty”. An entry is dirty when it has been marked asinvalid, such as when a write is pending to a location in graphicsmemory containing the buffer data that is stored in the entry. If, instep 611, Data Cache 158 determines that the entry is dirty, Data Cache158 reports a cache miss to Read Interface 153 and proceeds to step 613.In step 613 Read Interface 153 reads the location in graphics memory toobtain the buffer data, optionally stores the buffer data in an entrywithin Data Cache 158, outputs the buffer data (source data), andproceeds to step 629. If, in step 611, Data Cache 158 determines thatthe entry is not dirty, then in step 617 Data Cache 158 outputs thebuffer data stored in the entry and proceeds to step 627.

If, in step 605, Conflict Detection Unit 152 determines that thefragment program does not specify a read, in step 623 Conflict DetectionUnit 152 stores the position to be written (destination location) andoutputs the fragment and destination location to Fragment Processor 155.In step 625 Data Cache 158 determines if any entry is associated withthe destination location, and, if so, in step 627 Data Cache 158 marksthe entry associated with the destination location as “dirty”. If, instep 625 Data Cache 158 determines no entries are associated with thedestination location, Data Cache 158 proceeds to step 629.

In step 629 Texture Unit 154 outputs the fragment and any buffer dataread in step 613 or step 617 to Fragment Processing Unit 156 forprocessing as specified by the fragment program. In step 631 FragmentProcessing Unit 156 outputs shaded data and configuration control toRaster Operation Unit 165. Raster Operation Unit 165 processes theshaded data and Write Interface 157 and optionally outputs the processedshaded data to Memory Controller 120 with a write request to thedestination location. Write Interface 157 also outputs a write update toConflict Detection Unit 152. In step 633 Conflict Detection Unit 152unstores the position, as described further herein. In step 635 if theprocessed shaded data was output to Memory Controller 120 in step 631,Write Interface 157 outputs the processed shaded data and destinationlocation to Data Cache 158. Data Cache 158 stores the processed shadeddata in an entry associated with the destination location.

FIG. 7 is a block diagram of an exemplary embodiment of a portion ofConflict Detection Unit 152 in accordance with one or more aspects ofthe present invention. A Hash Unit 710 receives an Input 701 produces anOutput 703. Input 701 may include a buffer identification, a position(source location or destination location), a source read request, adestination write request, and a destination write confirmation. Thesource read request is asserted when a fragment program instructionspecifies a read. The destination write request is asserted when afragment program instruction specifies a write. The destination writeconfirmation is received from Write Interface 157 when a write iscompleted (write position confirmation).

A Hash Function 715 within Hash Unit 710 receives a first portion ofInput 701 and outputs an index to a storage resource, Storage 720. Astorage resource may be a register file, embedded RAM, or the like. Whenthe destination write request is asserted a second portion of Input 701is output by Hash Function 715 to Storage 720. The second portion ofInput 701 is stored in an entry, accessed using the index provided byHash Function 715, in a Storage 720. When the destination write requestis asserted a Compare Unit 725 outputs a signal on Output 703 indicatingthat a position conflict does not exist.

When the destination write confirmation is received from Write Interface157, Input 701 provides the destination write confirmation to HashFunction 715. Hash Function 715 outputs an index to Storage 720 and theentry corresponding to the index is cleared or otherwise marked asavailable.

When the source read request is asserted, Storage 720 outputs the datastored in the entry corresponding to the index to a Compare 725. Compare725 also receives the second portion of Input 701 from Hash Function 715and compares it to the data output by Storage 720. When the secondportion of Input 701 is equal to the data output by Storage 720, Compare725 outputs a signal on Output 703 indicating that a position conflictexists. When the second portion of Input 701 is not equal to the dataoutput by Storage 720 Compare 725 outputs a signal indicating that aposition conflict does not exist. When a position conflict exists,Conflict Detection Unit 152 blocks processing of the fragment until theposition conflict does not exist, i.e., a pending write to the sourceread position is completed.

In a first embodiment the first portion of Input 701 is the position andthe buffer identifier is the second portion of Input 701. In a secondembodiment the first portion of Input 701 is the buffer identifier andthe second portion of Input 701 is the position. In a third embodimentthe first portion of Input 701 is the buffer identifier and the positionand the second portion of Input 701 is a logic true. In the thirdembodiment Compare 725 is omitted and Output 703 is the output ofStorage 720.

Storage 720 has a limited number of entries that may vary from oneembodiment to another. When all of the entries are allocated and adestination write request is received requiring an unused entry, HashUnit 710 does not accept any new requests or confirmations on Input 701until an entry in Storage 720 becomes available. In a highly-parallelsystem, capable of processing thousands of samples an embodiment ofConflict Detection Unit 152 including Hash Unit 710 may become anexpensive solution because it requires storage of thousands of entriesfor optimal performance. An alternate embodiment relies on usingcoverage mask data to track pending writes for fragments being processedin Fragment Processor 155, as described further herein.

FIG. 8A illustrates Display 330 partitioned into tiles, such as Tile 805in accordance with one or more aspects of the present invention. Eachpixel within Display 330 is associated with an x,y position relative toa display origin. Each tile is associated with an x,y position, e.g.,tile origin, corresponding to a number of high-order bits of x and anumber of high-order bits of y. Likewise, a Pixel 810 within Tile 805 isassociated with an x,y position, e.g., pixel tile position, relative tothe tile origin of Tile 805. Each pixel tile position corresponds to anumber of low-order bits of x and a number of low-order bits of y.Therefore, a pixel position within Display 330 may be identified by anx,y position or a combination of a tile origin and a pixel tileposition. In an alternate embodiment Display 330 is replaced by an imagewhich is partitioned into tiles.

A coverage mask may be stored for each tile, the coverage maskrepresenting pending writes for each pixel tile position within thetile. In some embodiments the coverage mask may represent pending writesfor a group of pixel tile positions within the tile. In addition to atile origin, each tile may also have a unique tile number as anidentifier. In some embodiments the tile number may be the same as thetile origin.

FIG. 8B is a block diagram of one embodiment of Conflict Detection Unit152 in accordance with one or more aspects of the present invention.Conflict Detection Unit 152 receives an Input 851 and another input fromWrite Interface 157 and produces an output to Fragment Processor 155 anda Stall 863. Input 851 may include an x,y position (source location ordestination location), a buffer identifier, and a coverage mask. Theinput from Write Interface 157 includes a tile clear signal including atile number corresponding to the tile to be cleared.

A storage resource, Tile Lookup Unit 850 receives the tile originincluded in the x,y position and outputs a corresponding tile number toa Control Unit 860. In an alternate embodiment the tile number equalsthe tile origin, Tile Lookup Unit 850 is omitted, and the tile origin isreceived by Control Unit 860. When Tile Lookup Unit 850 does not includean entry for each tile within an image or Display 330, i.e. the tileresolution exceeds the number of entries in Tile Lookup Unit 850, TileLookup Unit 850 outputs a match signal indicating whether or not thetile origin matches the contents of an entry. When the match signalindicates the tile origin matches the contents of an entry, Tile LookupUnit 850 also outputs a tile number corresponding to the entry, e.g.,entry address, to Control Unit 860. In one embodiment Tile Lookup Unit850 is a content addressable memory (CAM).

Control Unit 860 outputs a write signal to Tile Lookup Unit 850 to writean entry in Tile Lookup Unit 850, effectively allocating an entry to atile corresponding to the tile origin. Control Unit 860 also outputs asignal, Stall 863, indicating whether or not Conflict Detection Unit 152may accept another Input 851, as described further herein in relation toFIG. 8C. Control Unit 860 outputs read and write requests to a storageresource, Tile Storage Unit 855. Tile Storage Unit 855 stores coveragemask data for each of the tiles that are stored in Tile Lookup Unit 850.Tile Storage Unit 855 receives the pixel position portion of Input 851from Control Unit 860 when the match signal indicates the tile numbermatches an entry in Tile Lookup Unit 850. Tile Storage Unit 855 outputsthe coverage mask corresponding to the pixel position to Control Unit860. Control Unit 860 receives tile clear commands, including a tilenumber, from Write Interface 157 and clears the entry in Tile LookupUnit 850 corresponding to the tile number and clears the coverage maskdata stored in Tile Storage Unit associated with the tile number.Control Unit 860 also writes coverage mask data to Tile Storage Unit 855to modify the coverage mask data and outputs commands to FragmentProcessor 155, as described further herein. In an alternate embodimentTile Lookup Unit 850 and Tile Storage Unit 855 are combined in onestorage resource.

Control Unit 860 produces tokens that are output via Fragment Processor155. The commands are determined based on the state of a tile, thecoverage mask data stored in Tile Storage Unit 855, Input 851, and thetile clear signal. The tile state for each tile may be stored in TileStorage Unit 855 and the tile state may be one of; CLEARING, EMPTY,ACTIVE, and FLUSH. In an alternate embodiment the tile state for eachtile is stored in Tile Lookup Unit 850. The tile state for each tile isinitialized to CLEARING.

When a first fragment including an x,y position and coverage mask data,is received by Conflict Detection Unit 152 an entry in Tile Lookup Unit850 is allocated to track x,y positions within the tile. The tile statefor the tile is changed from CLEARING to ACTIVE. When a second fragmentis received and the second fragment conflicts with the first fragment,i.e., the second fragment requires source data read from the x,yposition of the first fragment, the tile state is changed from ACTIVE toFLUSH and Control Unit 860 within Conflict Detection Unit 152 outputs aflush token to Read Interface 153. The flush token includes the tilenumber and the flush token is passed through Fragment Processor 155 andreturns to Control Unit 860 within Conflict Detection Unit 152 as aclear tile signal, also including the tile number. The clear tile signalis returned by Raster Operation Unit 165 after any writes preceeding theflush token are written to memory via Raster Operation Unit 165. ControlUnit 860 changes the tile state for a tile from FLUSH to EMPTY when aclear tile signal including the tile number for the tile is receivedfrom Raster Operation Unit 165.

FIG. 8C is a flow diagram of method steps for detecting positionconflicts during fragment processing, in accordance with one embodimentof the present invention. In step 815 Conflict Detection Unit 152receives a quad associated with an x,y position. As previously describedthe x,y position includes a tile origin and pixel tile position. A quadis four pixels arranged in a 2×2 square. In step 815 Conflict DetectionUnit 152 also receives a four bit coverage mask indicating which of thefour pixels are within a primitive. In an alternate embodiment, a quadincludes fewer or more pixels and the number of coverage mask bits isscaled accordingly. In step 817 Control Unit 860 receives the matchsignal from Tile Lookup Unit 850. If the match signal indicates the tileorigin matches the contents of an entry in Tile Lookup Unit 850, then instep 819 Control Unit 860 determines if the tile state is set to FLUSH,and, if so, Control Unit 860 proceeds to step 831. If, in step 817Control Unit 860 determines the match signal indicates the tile origin,then in step 818 Control Unit 860 waits for the tile state of a tile tobecome EMPTY, indicating an entry in Tile Lookup Unit 850 is available.Control Unit 860 asserts Stall 863 while waiting for the tile state of atile to become EMPTY, not accepting new data on Input 851. When Stall863 is asserted, Rasterizer 150 does not output additional fragments toConflict Detection Unit 152.

If, in step 819 Control Unit 860 determines the tile state is not set toFLUSH, then in step 821 Control Unit 860 determines if the tile state isset to ACTIVE. If the tile state is set to ACTIVE, Control Unit 860proceeds to step 823. In step 823 Control Unit 860 compares the coveragemask data read from Tile Storage Unit 855 with the coverage mask datareceived from Input 851. In step 825 Control Unit 860 determines if thecomparison indicates there is any overlap, and, if so, in step 829Control Unit 860 sets the tile state to FLUSH and outputs a flush tokento Fragment Processor 155.

In step 831, following either step 819 or step 829, Control Unit 860waits for the tile state to become EMPTY and then proceeds to step 833.Control Unit 860 asserts Stall 863 while waiting for the tile state tobecome EMPTY, thereby not accepting new data on Input 851. If, in step821 Control Unit 860 determines the tile state is not set to ACTIVE,i.e., the tile state is set to EMPTY, then in step 833 Control Unit 860sets the tile state to ACTIVE, writes the tile origin in the entry inTile Lookup Unit 850 (if the tile origin has changed) thereby allocatingthe entry to the tile origin, and writes the coverage mask data receivedvia Input 851 into Tile Storage Unit 855. In step 835 Control Unit 860determines if all of the tile entries in Tile Lookup Unit 850 areallocated and the tile states are all set to ACTIVE, i.e. if there isn'tan EMPTY tile or a tile with a tile state of FLUSH. If, in step 835,Control Unit 860 determines all of the tile entries are not allocated orall of the tile entries are allocated and at least one tile state is notset to ACTIVE, Control Unit 860 proceeds to step 839. Otherwise, ControlUnit 860 proceeds to step 837.

In step 837 Control Unit 860 identifies the least recently used (LRU)entry in Tile Lookup Unit 850 and outputs a flush token to ReadInterface 153, the flush token including the tile number correspondingto the LRU entry and proceeds to step 839. If, in step 825, Control Unit860 determines the comparison indicates there is not any overlap, thenin step 827 Control Unit 860 updates the coverage mask data stored inTile Storage Unit 855 by writing a combination, e.g., bitwise OR, of thecoverage mask data read from Tile Storage Unit 855 and the coverage maskdata received via Input 851. In step 839 Conflict Detection Unit 153passes the x,y position to Read Interface 153 for further processing.

An embodiment of Conflict Detection Unit 153 configured to use coveragemask data to track pending writes for fragments may include fewerstorage resources than an embodiment including Hash Unit 710.Furthermore, the number of pixels represented by a tile may vary fromone embodiment to another. Likewise the size of storage resources TileLookup Unit 850 and Tile Storage Unit 855 may be sized to store eachtile within an image or Display 330 or to store a small number of tiles.Increasing the size of the storage resources may reduce the number ofclock cycles spent waiting for a tile to become available forallocation, thereby improving fragment processing throughput of FragmentProcessor 155.

FIG. 9A is a block diagram of one embodiment of Conflict Detection Unit152 in accordance with one or more aspects of the present invention. Inaddition to Tile Lookup Unit 850, Tile Storage Unit 855, and ControlUnit 860, the embodiment shown in FIG. 9A includes an issue timestamp(ITS) Unit 970 and a retire timestamp (RTS) Unit 975. ITS Unit 970 andRTS Unit 975 are used during the generation of interlock tokens, asdescribed further herein. Specifically, the use of timestamps permitsmore than one “in-flight” interlock token to be within FragmentProcessor 155 for each tile stored in Tile Lookup Unit 850. Theembodiment of Conflict Detection Unit 152 illustrated in FIG. 8B onlypermits one in-flight flush token (similar to the interlock token) foreach tile. Permitting multiple in-flight interlock tokens may furtherreduce the number of clock cycles spent waiting for a tile to becomeavailable for allocation, thereby improving fragment processingthroughput of Fragment Processor 155.

In this embodiment of Conflict Detection Unit 152 Control Unit 860generates and outputs an interlock token to Read Interface 153 for everyn quads received via Input 851. In one embodiment n is equal to 32. Inother embodiments n may be greater than or less than 32. ITS Unit 970increments an issue-timestamp whenever an interlock token is output. Theinterlock token passes through Fragment Processor 155 to RasterOperation Unit 165 and an acknowledgement (ack) is output by WriteInterface 157 within Raster Operation Unit 165 when all of the reads andwrites preceeding the interlock token have been output by MemoryController 120 to Conflict Detection Unit 152. RTS Unit 975 increments aretire-timestamp whenever an ack is received via Write Interface 157. Inone embodiment the issue-timestamp and the retire-timestamp are set to apredetermined value at initialization. All issue-timestamp values inTile Storage Unit 855 are also set to the predetermined value atinitialization.

In addition to coverage mask data, Tile Storage Unit 855 stores anissue-timestamp value for each tile. Whenever an x,y position is outputby Control Unit 860 to Fragment Processor 155 the issue-timestamp iscopied into the entry in Tile Storage Unit 855 corresponding to the tilenumber. The difference between the issue-timestamp and theretire-timestamp defines a timestamp (TS) window. When anissue-timestamp value stored in Tile Storage Unit 855 lies within the TSwindow, a quad in the tile associated with the tile number is beingprocessed by Fragment Processor 155 or Raster Operation Unit 165.Conversely, when an issue-timestamp value stored in Tile Storage Unit855 lies outside of the TS window, the tile number is available forallocation to an incoming quad with a tile origin that does not match anentry in Tile Lookup Unit 850.

FIG. 9B is a flow diagram of method steps for detecting positionconflicts during fragment processing, in accordance with one embodimentof the present invention. In step 915 Conflict Detection Unit 152receives a quad associated with an x,y position, including coverage maskdata. In step 917 Control Unit 860 receives the match signal from TileLookup Unit 850. If the match signal indicates the tile origin matchesthe contents of an entry in Tile Lookup Unit 850, then in step 919Control Unit 860 reads the coverage mask data and the issue-timestampvalue from the entry in Tile Storage Unit 855 corresponding to the tilenumber received with the match signal from Tile Lookup Unit 850 in step917.

In step 929 Control Unit 860 determines if the issue-timestamp valueread in step 919 is within the TS window, and, if not, Control Unit 860proceeds to step 939. If, in step 929 Control Unit 860 determines theissue-timestamp value read in step 919 is within the TS window, then instep 931 Control Unit 860 compares the coverage mask data read from theentry to the coverage mask received in step 915. In step 933 ControlUnit 860 determines if the comparison indicates there is any overlap,and, if so, in step 935 Control Unit 860 asserts Stall 863 indicatingthat Conflict Detection Unit 152 is not accepting new data on Input 851.In step 935 Control Unit 860 also signals to ITS Unit 970 to incrementthe issue-timestamp and outputs an interlock token via FragmentProcessor 155.

In step 937 Control Unit 860 determines if the issue-timestamp valueread in step 919 is still within the TS window, and, if so, Control Unit860 remains in step 937 while asserting Stall 863 to indicate thatConflict Detection Unit 152 is not accepting new data on Input 851. If,in step 937 Control Unit 860 determines the issue-timestamp value readin step 919 is not within the TS window, then Control Unit 860 proceedsto step 939.

If, in step 917 Control Unit 860 determines the match signal indicatesthat the tile origin does not match the contents of an entry in TileLookup Unit 850, then in step 921 Control Unit 860 determines if anentry in Tile Lookup Unit 850 is available for allocation. If an entryis available, then Control Unit 860 proceeds to step 927. Otherwise,Control Unit 860 proceeds to step 923 and identifies the LRU (available)entry in Tile Lookup Unit 850, signals to ITS Unit 970 to increment theissue-timestamp, and outputs an interlock token to read Interface 153.In step 925 Control Unit 860 determines if an entry in Tile Lookup Unit850 is available for allocation, and, if not, Control Unit 860 remainsin step 925 while asserting Stall 863 to indicate that ConflictDetection Unit 152 is not accepting new data on Input 851. If, in step925 Control Unit 860 determines an entry in Tile Lookup Unit 850 isavailable for allocation, then Control Unit 860 proceeds to step 927. Instep 927 Control Unit 860 writes the tile origin received in step 915(extracted from the x,y position) into the entry, thereby allocating theentry to the tile origin. In step 939 Control Unit 860 writes thecoverage mask received in step 915 into the entry in Tile Storage Unit855 associated with the tile number of the entry in Tile Lookup Unit850. In step 939 Control Unit 860 also copies the issue-timestamp valueinto the entry in Tile Storage Unit 855 associated with the tile numberand proceeds to step 943.

If, in step 933, Control Unit 860 determines the comparison indicatesthere is not any overlap, then in step 941 Control Unit 860 combines thecoverage mask data read from Tile Storage Unit 855 in step 919 with thecoverage mask received in step 915 to produce combined coverage maskdata and writes the combined coverage mask data to the entry in TileStorage Unit 855. In step 941 Control Unit 860 also copies theissue-timestamp from ITS Unit 970 to the entry in Tile Storage Unit 855.In step 943 Conflict Detection Unit 153 passes the x,y position receivedin step 915 to Fragment Processor 155 for further processing.

FIGS. 10A, 10B, and 10C illustrate embodiments of methods of processingfragment program instructions, including a PLD (pixel load) instructionin accordance with one or more aspects of the present invention. An API(Application Programming Interface) for a programmable graphicsprocessor includes the PLD instruction to configure Conflict DetectionUnit 152 within Programmable Graphics Processor 105 to detect a positionconflict for a position and prevent a subsequent access of the positionuntil the position conflict is resolved. In some embodiments ConflictDetection Unit 152 is located within Fragment Processor 155.

In step 1015, Conflict Detection Unit 152 receives a fragment programinstruction specifying a write to a first destination location. Thefirst destination location may be a register in Fragment Processor 155or a location in graphics memory within a buffer. The first destinationlocation may also include a buffer identification. The buffer mayinclude depth data, color data, stencil data, or the like.

In step 1019, Conflict Detection Unit 152 receives a PLD instructionincluding a source location and a second destination location. In oneembodiment the source location is the first destination location and thesecond destination location is Register 159. In another embodiment thesource location is another location within the buffer. In yet anotherembodiment the source location is another location within anotherbuffer.

In step 1021, Conflict Detection Unit 152 determines if a write to thesource location is pending, and, if so, Conflict Detection Unit 152remains in step 1021, waiting until the write to the source location iscomplete, i.e. for the position conflict to be resolved. Execution ofthe PLD instruction eliminates the need for executing a flushinstruction to drain Fragment Processing Pipeline 160 prior to readingthe source location.

If, in step 1021, Conflict Detection Unit 152 determines that a write tothe source location is not pending, in step 1023, Read Interface 153outputs a read request for the source location to Memory Controller 120and receives the data stored in the source location from MemoryController 120. In an alternate embodiment Read Interface 153 reads thedata stored in the source location from Data Cache 158. In step 1025,Read Interface 153 outputs the data stored in the source location toFragment Processing Unit 156 and Fragment Processing Unit 156 stores thedata in the destination location, e.g. Register 159.

FIG. 10B illustrates an embodiment of a method of processing fragmentprogram instructions, including the steps described in relation to FIG.10A. In step 1015 Conflict Detection Unit 152 receives a fragmentprogram instruction specifying a write to a first destination location.In step 1017 Conflict Detection Unit 152 receives additional fragmentprogram instructions. The additional program instructions may includewrite instructions specifying other destination locations. Steps 1019,1021, 1023 and 1025 are completed as described in relation to FIG. 10A.

In an embodiment the source location specified in the PLD instruction isthe first destination location specified in the fragment programinstruction received in step 1015. Execution of the PLD instruction inthe embodiment permits reading the source location during processing ofthe additional fragment program instructions rather than drainingFragment Processor 155 after the write to the first destination locationand before executing the source read. Steps 1015, 1019, 1021, 1023, and1025 are completed as previously described.

FIG. 10C illustrates an embodiment of a method of processing fragmentprogram instructions, including the steps described in relation to FIG.10A. Steps 1015, 1019, 1021, 1023, and 1025 are completed as describedin relation to FIG. 10A. In step 1027 Conflict Detection Unit 152outputs another fragment program instruction to Fragment Processor 155for execution. In the method illustrated in FIG. 10C, Fragment Processor155 does not process the other fragment program until the PLDinstruction has been executed.

FIG. 10D illustrates a method of processing fragment programinstructions using an alternate embodiment of Conflict Detection Unit152, which permits execution of program instructions, while waiting fora write to complete before executing a PLD instruction. Steps 1015 and1019 are completed as described in relation to FIG. 10A. In step 1021,Conflict Detection Unit 152 determines if a write to the source locationis pending, and, if so, in step 1027, Conflict Detection Unit 152outputs another (subsequent) fragment program instruction to FragmentProcessor 155 for execution, permitting the subsequent fragment programinstruction to effectively bypass the PLD instruction.

A subsequent fragment program instruction may only be permitted tobypass a pending fragment program instruction if the subsequent fragmentprogram instruction does not have a data dependency on the pendingfragment program instruction, i.e., the subsequent fragment programinstruction does not source data that is produced by the pendingfragment program instruction. After executing the subsequent fragmentprogram instruction, Fragment Processor 155 returns to step 1021. Instep 1021, Conflict Detection Unit 152 determines if a write to thesource location is still pending, and, if not, steps 1023 and 1025 arecompleted as previously described to complete execution of the PLDinstruction.

Embodiments of Conflict Detection Unit 152 that permit fragment programinstructions without position conflicts to bypass fragment programinstructions with position conflicts include storage resources to storethe fragment program instructions with position conflicts. ConflictDetection Unit 152 outputs a stored fragment program instruction whenthe position conflict is removed for that fragment program instruction.Likewise, some embodiments of Conflict Detection Unit 152 includestorage resources to store fragments associated with positions for whichconflicts exist. When storage resources are not available, ConflictDetection Unit 152 blocks fragment processing until storage resourcesbecome available.

FIG. 11A illustrates an embodiment of a method of depth buffering priorto shading graphics data in accordance with one or more aspects of thepresent invention. It is desirable to minimize texture reads andcomputing resources by not shading any fragments that fail the depthtest, i.e., which are behind another fragment. Therefore, to maximizeperformance and minimize unnecessary graphics memory reads it isdesirable to perform depth buffering prior to shading. The PLDinstruction may be used to configure Fragment Processor 155 to performdepth buffering prior to shading.

In step 1101 Fragment Processor 155 is configured by fragment programinstructions to compute the fragment depth value of a fragment for aposition. In step 1103 Texture Unit 154 reads a depth buffer value forthe position. The read is performed using a PLD instruction, i.e.,Conflict Detection Unit 152 detects any position conflicts and the readis not performed until any detected position conflicts are resolved. Thedepth buffer value read is stored in Register 159. In step 1105 TextureUnit 154 outputs the depth buffer value and the fragment depth value toFragment Processing Unit 156. Fragment Processing Unit 156 is configuredby the fragment program instructions to determine if the fragment depthvalue will be written to the depth buffer. For example, in oneembodiment, the fragment will be written to the depth buffer when thefragment depth value is nearer to the viewpoint than the depth buffervalue at the position. If, in step 1105, Fragment Processing Unit 156determines the fragment depth value will be written to the depth buffer,then, in step 1109, Fragment Processing Unit 156 is configured by thefragment program instructions to produce a computed fragment color.

In step 1111, Fragment Processor 155 determines if the fragment programinstructions specify to read a buffer, such as a texture map, to computea shaded fragment color, and, if so, the fragment is processed in anadditional pass within Fragment Processor 155. In step 1113, TextureUnit 154 is configured by the fragment program instructions to readbuffer data from the buffer and output the buffer data to FragmentProcessing Unit 156. In step 1115, Fragment Processing Unit 156 isconfigured by the fragment program instructions to shade the fragmentusing the computed fragment color and the buffer data to produce ashaded fragment color. If, in step 1111, Fragment Processor 155determines the fragment program instructions do not specify to read abuffer, then the computed fragment color is the shaded fragment colorand Fragment Processor 155 proceeds to step 1116.

In step 1116, Fragment Processor 155 determines if blending is enabled,and if not, Fragment Processor 155 proceeds to step 1121. If, in step1116, Fragment Processor 155 determines that blending is enabled, thenin step 1117, the shaded fragment color, configuration control, andfragment depth value are output by Fragment Processor 155 to RasterOperation Unit 165. Raster Operation Unit 165 reads a color from abuffer, such as a color buffer, for the position. In step 1119 RasterOperation Unit 165 is configured by the fragment program instructions toblend the color read from the color buffer with the shaded fragmentcolor to produce a blended color. In step 1121, Write Interface 157within Raster Operation Unit 165 writes the blended color and thefragment depth value to the color buffer and the depth buffer,respectively. In an alternate embodiment, the color data and the depthdata are stored in a buffer containing color and depth in each locationwithin the buffer.

In step 1123, Fragment Processor 155 determines if another fragment willbe processed, and, if so, returns to step 1101. In step 1101 FragmentProcessor 155 is configured by fragment program instructions to computethe fragment depth value of another fragment for another position. Instep 1103 Texture Unit 154 reads a depth buffer value for the otherposition. The read is performed using the PLD instruction, and the depthbuffer value read is stored in Register 159. Because Fragment Processor155 is pipelined, processing of the other fragment may begin beforeprocessing of the fragment is completed. Therefore, the PLD instructionshould be used to detect and avoid RAW position conflicts. When the PLDinstruction is not used, Fragment Processing Pipeline 160 may be flushedusing an instruction to assure processing of the other fragment does notbegin until the processed fragment is output to graphics memory.Flushing should be minimized to effectively utilize computing resourceswithin Fragment Processing Pipeline 160 and to maximize fragmentthroughput.

In step 1105, Fragment Processing Unit 156 receives the depth buffervalue read in step 1103 and the fragment depth value computed in step1101. Fragment Processing Unit 156 is configured by the fragment programinstructions to determine if the fragment depth value will be written tothe depth buffer. If, in step 1105, Fragment Processing Unit 156determines the fragment depth value will not be written to the depthbuffer, then, in step 1123 Fragment Processor 155 determines if anotherfragment will be processed, and, if not, in step 1131 Output Controller180 reads the color buffer for output to Output 185, such as a displayor the like. In an alternative embodiment, the color buffer is outputvia either Graphics Interface 117 or Output Controller 180 to a filmrecording device or written to a peripheral device, e.g., disk drive,tape, compact disk, or the like.

FIG. 11B illustrates an embodiment of a method of depth peeling inaccordance with one or more aspects of the present invention. Depthpeeling is a method of rendering an image without sorting (by depth) thefragments prior to rendering. Each fragment within an image is processedby Fragment Processing Pipeline 160 to determine the front-most depthvalue and color for each position within the image. The front-most depthvalue and color are stored in either a first buffer containing depth andcolor or in two buffers, one containing color (a first color buffer) andone containing depth (a first depth buffer). Each fragment is optionallyprocessed by Fragment Processing Pipeline 160 during a number ofadditional passes through Graphics Processing Pipeline 103. Eachadditional pass determines the “next” front-most fragment layer in theimage, storing depths of the next front-most layer in a second depthbuffer and storing colors of the next front-most layer in a second colorbuffer. When applying depth peeling for order-independent transparency,each next front-most layer is optionally blended with the front-mostlayer(s) at the end of each additional pass. In an alternativeembodiment, the second color buffer stores colors of the next front-mostlayer blended with the front-most colors.

At the end of the first additional pass through Graphics ProcessingPipeline 103 the second color buffer contains the image color for thefirst two layers of fragments. A second additional pass through GraphicsProcessing Pipeline 103 may be completed, storing a next front-mostdepth in the first depth buffer and a blended color for the first threelayers of fragments in the first color buffer. Likewise, furtheradditional passes through Graphics Processing Pipeline 103 may becompleted either reading from the first depth and color buffers andwriting to the second depth and color buffers or reading from the seconddepth and color buffers and writing to the first depth and colorbuffers. The PLD instruction is used during depth peeling to improvefragment processing throughput so that Fragment Processing Pipeline 160does not need to be flushed between each pass to avoid positionconflicts.

Steps 1101, 1103, and 1105 are completed as described in relation toFIG. 11A. If, in step 1105 Fragment Processing Unit 156 determines thefragment depth value will be written to the depth buffer in step 1114Fragment Processing Unit 156 is configured by the fragment programinstructions to produce a shaded fragment color. Step 1114 includessteps 1109, 1111, 1113, and 1115 shown in FIG. 11A. In step 1121 WriteInterface 157 within Raster Operation Unit 165 writes the shadedfragment color and the fragment depth value to the first color bufferand the first depth buffer respectively.

In step 1123 Fragment Processor 155 determines if another fragment willbe processed, and, if so, returns to step 1101. In step 1101 FragmentProcessor 155 is configured by fragment program instructions to computethe fragment depth value of another fragment for another position. Instep 1103 Texture Unit 154 reads a depth buffer value for the otherposition. In step 1105, Fragment Processing Unit 156 receives the depthbuffer value read in step 1103 and the fragment depth value computed instep 1101. Fragment Processing Unit 156 is configured by the fragmentprogram instructions to determine if the fragment depth value will bewritten to the first depth buffer. If, in step 1105 Fragment ProcessingUnit 156 determines the fragment depth value will not be written to thefirst depth buffer, then in step 1123 Fragment Processor 155 determinesif another fragment will be processed, and, if so Fragment Processor 155returns to step 1101. If, in step 1123, Fragment Processor 155determines another fragment will not be processed, then in step 1125,Fragment Processor 155 determines if this is the first pass throughGraphics Processing Pipeline 103. If, in step 1125, Fragment Processor155 determines this is the first pass through Graphics ProcessingPipeline 103, then in step 1129, Graphics Processing Pipeline 103determines if another pass through Graphics Processing Pipeline 103, thefirst additional pass, will be completed to determine the nextfront-most fragment layer within the image. If, in step 1129, GraphicsProcessing Pipeline 103 determines another pass will be completed,Fragment Processor 155 returns to step 1101. Prior to starting the firstadditional pass, the second depth buffer is initialized to the furthestdepth value to determine the next front-most fragment layer which liesbetween the front-most layer and the furthest depth value.

In step 1101 Fragment Processor 155 is configured by fragment programinstructions to compute the fragment depth value of a fragment for aposition. In step 1103 Texture Unit 154 reads depth buffer values forthe position from the first depth buffer and the second depth buffer.The read of the second depth buffer (the first depth buffer is read-onlyfor this pass) is performed using the PLD instruction and the depthbuffer value read (next front-most) is optionally stored in Register159. The depth buffer value read from the first depth buffer may also bestored in a register, like Register 159, within Fragment Processing Unit156.

In step 1105, Fragment Processing Unit 156 receives the front-most depthbuffer value read from the first depth buffer in step 1103, the nextfront-most depth buffer value read from the second depth buffer in step1103, and the fragment depth value computed in step 1101. FragmentProcessing Unit 156 is configured by the fragment program instructionsto determine if the fragment depth value will be written to the depthbuffer. For example, the fragment will be written to the depth bufferwhen the fragment depth value is nearer to the viewpoint than the nextfront-most depth buffer value at the position and further from theviewpoint than the front-most depth buffer value at the position. If, instep 1105, Fragment Processing Unit 156 determines the fragment depthvalue will be written to the second depth buffer, then in step 1114,Fragment Processing Unit 156 is configured by the fragment programinstructions to produce a shaded fragment color.

In step 1121 the shaded fragment color and fragment depth value areoutput by Fragment Processor 155 to Raster Operation Unit 165 and RasterOperation Unit 165 writes the shaded fragment color and fragment depthvalue to the second color buffer and the second depth buffer,respectively. In an alternative embodiment, in step 1121, RasterOperation Unit 165 reads a color from the first color buffer for theposition and Raster Operation Unit 165 is configured by the fragmentprogram instructions to blend the color read from the first color bufferwith the shaded fragment color to produce a blended color. In thealternative embodiment, Write Interface 157 within Raster Operation Unit165 writes the blended color and the fragment depth value to the secondcolor buffer and the second depth buffer respectively.

In step 1123, Fragment Processor 155 determines if another fragment willbe processed, and, if so, returns to step 1101. In step 1101, FragmentProcessor 155 is configured by fragment program instructions to computethe fragment depth value of another fragment for another position. Instep 1105, Fragment Processing Unit 156 receives the front-most depthbuffer value read from the first depth buffer in step 1103, the nextfront-most depth buffer value read from the second depth buffer in step1103, and the fragment depth value computed in step 1101. The read ofthe second depth buffer is performed using the PLD instruction and thedepth buffer value read (next front-most) is stored in Register 159. Thedepth buffer value read from the first depth buffer may also be storedin a register, like Register 159, within Fragment Processing Unit 156.Fragment Processing Unit 156 is configured by the fragment programinstructions to determine if the fragment depth value will be written tothe depth buffer. If, in step 1105, Fragment Processing Unit 156determines the fragment depth value will not be written to the seconddepth buffer, then in step 1123, Fragment Processor 155 determines ifanother fragment will be processed. If, in step 1123, Fragment Processor155 determines another fragment will not be processed, then in step1125, Fragment Processor 155 determines if this is the first passthrough Graphics Processing Pipeline 103.

If, in step 1125, Fragment Processor 155 determines this is not thefirst pass through Graphics Processing Pipeline 103, then in step 1127,Fragment Processor 155 blends the front-most (first) color buffer withthe next front-most (second) color buffer and stores the blended colorbuffers in the second color buffer. In step 1129 Graphics ProcessingPipeline 103 determines if another pass will be completed to process thenext front-most layer of fragments in the image. If, in step 1129Graphics Processing Pipeline 103 determines another pass will becompleted, then steps 1101, 1103, 1105, 1114, 1121, 1123, and 1125 arerepeated with the second depth and color buffers containing thefront-most layers (read-only) and writing the third layer to the firstdepth and color buffers.

If, in step 1125 Graphics Processing Pipeline 103 determines anotherpass through Graphics Processing Pipeline 103 will not be completed,then in step 1131, Output Controller 180 reads the first or second colorbuffer, whichever was written during the last pass, for output to Output185, such as a display or the like. In an alternative embodiment, thecolor buffer is output via either Graphics Interface 117 or OutputController 180 to a film recording device or written to a peripheraldevice, e.g., disk drive, tape, compact disk, or the like.

FIG. 11C illustrates another embodiment of a method of depth peeling inaccordance with one or more aspects of the present invention. Thisembodiment uses a depth and a color buffer (or a combined depth andcolor buffer) for each layer and includes some of the steps described inrelation to FIGS. 11A and 11B. In contrast to the method described inrelation to FIG. 11B, sorting of the layers is completed in a singleextra pass through Graphics Processing Pipeline 103. After the layershave been sorted Fragment Processor 155 blends the layers to produce animage for output. Alternatively, the layers are blended by RasterOperation Unit 165 to produce the image for output. The PLD instructionis used to improve fragment processing throughput so that FragmentProcessing Pipeline 160 does not need to be flushed during the singleextra pass through Graphics Processing Pipeline 103 to avoid positionconflicts. In some embodiments the four front-most layers are stored togenerate the image for output. In an alternate embodiment, RasterOperation Unit 165 performs the sorting of the layers.

In step 1101 Fragment Processor 155 is configured by a fragment programto compute the fragment depth value of a fragment for a position. Instep 1103 Texture Unit 354 reads depth buffer values for the positionfrom each depth buffer storing a layer of depth values for the image asspecified by a fragment program. In step 1104 Fragment Processor 155determines if the layers need to be reordered. For example, the layersneed to be reordered if the fragment depth value is between the depthvalues in layer 1 and the depth value in layer 2, where layer 1 is thefront-most layer. The fragment depth value in layer 2 is moved to layer3 and the fragment depth value will be written to layer 2. If layer 3has not been used, an output buffer identifier will be assigned to layer3 and each memory location in the layer 3 depth buffer is initialized tothe furthest depth value. Likewise, each memory location in the layer 3color buffer is initialized to transparent black.

If, in step 1104, Fragment Processor 155 determines if the layers needto be reordered, in step 1106 Fragment Processor 155 determines theoutput buffer identifier associated with each depth value that is movedfrom one depth buffer (layer) to another depth buffer (layer) duringreordering. Fragment Processor 155 also determines the output bufferidentifier associated with the fragment depth value. Likewise, FragmentProcessor 155 determines the output buffer identifier associated witheach color value that is moved from one color buffer to another colorbuffer during reordering.

If, in step 1104, Fragment Processor 155 determines the layers do notneed to be reordered, Fragment Processor 155 proceeds to step 1114. Forexample, the layers do not need to be reordered if the fragment depthvalue is behind the depth value in layer 1 and the depth value in layer2, where layer 1 is the front-most layer. The fragment depth value willbe written to unused layer 3 and an output buffer identifier will beassigned to layer 3. In step 1114, Fragment Processing Unit 156 isconfigured by the fragment program to produce a shaded fragment colorfor the fragment.

In step 1120, Fragment Processing Unit 156 outputs configurationcontrol, the fragment depth value, depth buffer identifier, shadedfragment color, color buffer identifier, and reordered data to RasterOperation Unit 165. In one embodiment, the reordered data includesadditional depth and color buffer identifiers corresponding to reorderedlayers of color and depth values. The additional depth bufferidentifiers are used by Raster Operation Unit 165 to read the depthbuffer values reordered in step 1106. Likewise, the additional colorbuffer identifiers are used by Raster Operation Unit 165 to read thecolor buffer values reordered in step 1106. In another embodiment, thereordered data includes reordered color values and color bufferidentifiers and reordered depth values and depth buffer identifiers.

In step 1114, Raster Operation Unit 165 writes the shaded fragment colorto the color buffer corresponding to the color buffer identifier. RasterOperation Unit 165 writes the fragment depth value to the depth buffercorresponding to the depth buffer identifier. Raster Operation Unit 165also writes each additional depth value reordered in step 1106 to eachdepth value's associated depth buffer corresponding to each depthvalue's color buffer identifier determined in step 1106. Likewise,Raster Operation Unit 165 also writes each additional color valuereordered in step 1106 to each color value's associated color buffercorresponding to each color value's color buffer identifier determinedin step 1106.

In step 1123, Fragment Processor 155 determines if another fragment willbe processed, and, if so, steps 1101, 1103, 1104, 1106, 1114, and 1120are repeated. If, in step 1123, Fragment Processor 155 determinesanother fragment will not be processed, depth sorting and shading of allof the fragments in the image is complete. In step 1124, each colorbuffer containing a layer is read by Raster Operation Unit 165. In step1126 each position in each color buffer is blended by Raster OperationUnit 165 to produce a blended color buffer. In one embodiment the colorbuffers are read and the color values for each position are blended froma back-to-front order to produce a blended color value for eachposition. In another embodiment the color buffers are read and the colorvalues for each position are blended from a front-to-back order toproduce a blended color value for each position. In yet anotherembodiment, Texture Unit 354 reads the color buffers and FragmentProcessing Unit 356 blends the color values for each position andoutputs a blended color value for each position to Raster Operation Unit165.

In step 1128 Raster Operation Unit 165 writes the blended color valuesto an output buffer (color buffer). The output buffer may be one of thecolor buffers read in step 1124. In step 1132 Output Controller 180reads the output buffer for output to Output 185, such as a display orthe like. In an alternative embodiment, the output buffer is output viaeither Graphics Interface 117 or Output Controller 180 to a filmrecording device or written to a peripheral device, e.g., disk drive,tape, compact disk, or the like.

In further embodiments of methods of processing graphics data, the PLDinstruction may be used to perform frame buffer blending, floating-pointraster operations, dual depth shadow mapping, and the like, usingFragment Processing Pipeline 160.

FIG. 12A is an alternate embodiment of Computing System 100 inaccordance with one or more aspects of the present invention. In thisembodiment Programmable Graphics Processor 105 includes, among othercomponents, a Front End 1230 that receives commands from Host Computer110 via Graphics Interface 117. Front End 1230 interprets and formatsthe commands and outputs the formatted commands and data to an IndexProcessor 1235. Some of the formatted commands are used by aProgrammable Graphics Processing Pipeline 1250 to initiate processing ofdata by providing the location of program instructions or graphics datastored in memory. Index Processor 1235, Programmable Graphics ProcessingPipeline 1250 and Raster Operation Unit 165 each include an interface toMemory Controller 120 through which program instructions and data may beread from graphics memory.

Index Processor 1235 optionally reads processed data, e.g., data writtenby Raster Operation Unit 165, from graphics memory and outputs the data,processed data and formatted commands to Programmable GraphicsProcessing Pipeline 1250. Programmable Graphics Processing Pipeline 1250and Raster Operation Unit 165 each contain one or more programmableprocessing units to perform a variety of specialized functions. Some ofthese functions are table lookup, scalar and vector addition,multiplication, division, coordinate-system mapping, calculation ofvector normals, tessellation, calculation of derivatives, interpolation,and the like. Programmable Graphics Processing Pipeline 1250 and RasterOperation Unit 165 are each optionally configured such that dataprocessing operations are performed in multiple passes through thoseunits or in multiple passes within Programmable Graphics ProcessingPipeline 1250.

In one embodiment Programmable Graphics Processing Pipeline 1250performs geometry computations, rasterization, and pixel computations.Therefore, Programmable Graphics Processing Pipeline 1250 is programmedto operate on surface, primitive, vertex, fragment, pixel, sample, orany other data.

FIG. 12B is a block diagram of an exemplary embodiment of ProgrammableGraphics Processing Pipeline 1250 in accordance with one or more aspectsof the present invention. Samples, such as surfaces, primitives, or thelike, are received from Index Processor 1235 by Programmable GraphicsProcessing Pipeline 1250 and stored in a Vertex Input Buffer 1220 in aregister file, FIFO (first in first out) memory, cache, or the like (notshown). The samples are broadcast to Execution Pipelines 1240, four ofwhich are shown in FIG. 12B. An alternate embodiment may include eithermore or fewer Execution Pipelines 1240. Each Execution Pipeline 1240includes at least one multithreaded processing unit. The samples outputby Vertex Input Buffer 1220 may be processed by any one of the ExecutionPipelines 1240. A sample is accepted by an Execution Pipeline 1240 whena processing thread within the Execution Pipeline 1240 is available.

Execution Pipelines 1240 may receive first samples, such as higher-ordersurface data, and tessellate the first samples to generate secondsamples, such as vertices. Execution Pipelines 1240 may be configured totransform the second samples from an object-based coordinaterepresentation (object space) to an alternatively based coordinatesystem such as world space or normalized device coordinates (NDC) space.Each Execution Pipeline 1240 communicates with Texture Unit 154 usingRead Interface 153 to read program instructions and graphics data storedin buffers in graphics memory via Memory Controller 120. An optionalData Cache 158 within Texture Unit 154 is used to improve memory readperformance by reducing read latency. In another alternate embodiment, aTexture Unit 154 is included in each Execution Pipeline 1240. In yetanother alternate embodiment, program instructions are stored withinProgrammable Graphics Processing Pipeline 1250.

Execution Pipelines 1240 output processed samples, such as vertices,that are stored in a Vertex Output Buffer 1260 in a register file, FIFOmemory, cache, or the like (not shown). Processed vertices output byVertex Output Buffer 1260 are received by a Primitive Assembly/Setup1205. Primitive Assembly/Setup 1205 calculates parameters, such asdeltas and slopes, for rasterizing the processed vertices. PrimitiveAssembly/Setup 1205 outputs parameters and samples, such as vertices, toRaster Unit 1210. The Raster Unit 1210 performs scan conversion onsamples and outputs fragments to a Pixel Input Buffer 1215.

A graphics program (vertex program or fragment program) is executedwithin one or more Execution Pipelines 1240 as a plurality of threadswhere each vertex or fragment to be processed by the program is assignedto a thread. Although threads share processing resources withinProgrammable Graphics Processing Pipeline 1250 and graphics memory, theexecution of each thread proceeds in the one or more Execution Pipelines1240 independent of any other threads. A RAW position conflict may existwhen a fragment program specifies to write to a position in a bufferthat the fragment program later specifies to read from. Likewise, a RAWposition conflict may exist when a fragment program specifies to writeto a position in a buffer that a subsequent fragment program specifiesto read from. Furthermore, because threads are executed independently,RAW conflicts may exist when a thread executes a write to a position ina buffer that the thread or another thread executes a read from.

In order to eliminate the need to track RAW conflicts between two ormore Execution Pipelines 1240, each Execution Pipeline 1240 isconfigured to process fragments for at least one specific destinationlocation. For example, an Execution Pipeline 1240 is configured toprocess fragments corresponding to any destination location within acontiguous region, e.g. (x,y) position, scanline, tile, or the like. Inanother example, an Execution Pipeline 1040 is configured to processfragments corresponding to any destination location modulo n verticallyand modulo m horizontally, e.g., one (x,y) position in each tile, everymth (x,y) position in a scanline, and the like. Texture Unit 154includes Conflict Detection Unit 152 to track pending destination writeoperations in order to detect and avoid RAW position conflicts.Alternatively, each Execution Pipeline 1240 includes a ConflictDetection Unit 152. Furthermore, if execution of a thread is blockedbecause of a RAW position conflict, some embodiments may permitexecution of one or more other threads that do not have positionconflicts, thereby improving throughput.

Pixel Input Buffer 1215 receives fragments from Raster Unit 1010 andoutputs the fragments to each Execution Pipeline 1240. The fragments,output by Pixel Input Buffer 1215, are each processed (as in FragmentProcessing Unit 156) by only one of the Execution Pipelines 1240. PixelInput Buffer 1215 determines which one of the Execution Pipelines 1240to output each fragment to depending on a position, e.g., (x,y),associated with each sample. In this manner, each fragment is output tothe Execution Pipeline 1240 designated to process fragments associatedwith the position.

Each Execution Pipeline 1240 signals to Pixel Input Buffer 1240 when afragment can be accepted or when a fragment cannot be accepted. Fragmentprogram instructions associated with a thread configure at least onemultithreaded processing unit within an Execution Pipeline 1240 toperform operations such as texture mapping, shading, blending, and thelike. Processed fragments are output from each Execution Pipeline 1040to a Pixel Output Buffer 1270. Pixel Output Buffer 1270 optionallystores the processed samples in a register file, FIFO memory, cache, orthe like (not shown). The processed samples are output from Pixel OutputBuffer 1270 to Raster Operation Unit 165.

Execution Pipelines 1240 are optionally configured using programinstructions read by Texture Unit 154 such that data processingoperations are performed in multiple passes through at least onemultithreaded processing unit within Execution Pipelines 1240.

FIG. 12C is another block diagram of an exemplary embodiment ofProgrammable Graphics Processing Pipeline 1250 in accordance with one ormore aspects of the present invention. In this embodiment each ExecutionPipeline 1240 may process fragments associated with any position. Eachfragment output by Pixel Input Buffer 1215 is processed by an availableExecution Pipeline 1040. Conflict Detection Unit 152 is included inPixel Input Buffer 1215 instead of in either Texture Unit 154 or eachExecution Pipeline 1240.

The invention has been described above with reference to specificembodiments. It will, however, be evident that various modifications andchanges may be made thereto without departing from the broader spiritand scope of the invention as set forth in the appended claims. Theforegoing description and drawings are, accordingly, to be regarded inan illustrative rather than a restrictive sense. The listing of steps inmethod claims do not imply performing the steps in any particular order,unless explicitly stated in the claim. Within the claims, elementlettering (e.g., “a)”, “b)”, “i)”, “ii)”, etc.) does not indicate anyspecific order for carrying out steps or other operations; the letteringis included to simplify referring to those elements.

1. A method of avoiding a position conflict during fragment shading,comprising: partitioning an image into tiles, each tile associated witha unique tile origin; allocating an entry in at least one storageresource to a tile origin, the entry specified by a tile number; storinga portion of a position associated with at least one fragment in theentry, wherein the at least one fragment is produced by a graphicsprimitive intersecting a pixel within a tile identified by the tilenumber; outputting a token when a position conflict is detected withinthe tile; and delaying processing of a fragment that corresponds to theposition conflict.
 2. The method of claim 1, further comprising storinga coverage mask associated with the at least one fragment in the entry.3. The method of claim 1, further comprising storing a tile state in theentry.
 4. The method of claim 1, further comprising storing a timestampvalue in the entry.
 5. The method of claim 2, further comprising:combining the coverage mask associated with the at least one fragmentwith coverage mask data associated with at least one other fragment toproduce combined coverage mask data; and storing the combined coveragemask data in the entry.
 6. The method of claim 1, wherein the number ofentries in the at least one storage resource is less than the number oftiles in the image.
 7. The method of claim 1, further comprisingoutputting the position associated with at least one fragment when aposition conflict does not exist.
 8. The method of claim 1, furthercomprising outputting a token when a predetermined number of quads arereceived.
 9. The method of claim 8, further comprising updating atimestamp when the token is output.
 10. A conflict detection unitconfigured to detect position conflicts during fragment shading,comprising: at least one storage resource including entries configuredto store tile origins and coverage mask data; and a control unitconfigured to determine whether or not a position conflict exists duringfragment shading within a tile associated with a tile origin stored inthe at least one storage resource and output a stall signal indicatingwhether or not the conflict detection unit will accept new data.
 11. Theconflict detection unit of claim 10, wherein the control unit isconfigured to output a token when a position conflict is detected. 12.The conflict detection unit of claim 10, wherein the control unit isconfigured to output a token when all of the entries within the at leastone storage resource are allocated.
 13. The conflict detection unit ofclaim 10, wherein the control unit is configured to output a token whena predetermined number of quads are received.
 14. The conflict detectionunit of claim 10, wherein the control unit is configured to combine acoverage mask with coverage mask data read from an entry in the at leastone storage resource to produce combined coverage mask data and writethe combined coverage mask data to the entry.
 15. The conflict detectionunit of claim 10, further comprising a timestamp unit configured tomaintain a timestamp.
 16. The conflict detection unit of claim 15,wherein the control unit is configured to copy the timestamp from thetimestamp unit to an entry in the at least one storage resource.
 17. Theconflict detection unit of claim 10, further comprising a read interfaceconfigured to read data from at least one buffer.
 18. The conflictdetection unit of claim 10, further comprising a fragment processingunit configured to receive fragments produced by rasterizing graphicsprimitives, each fragment associated with a position, and the data readfrom the at least one buffer and generate processed fragments.
 19. Theconflict detection unit of claim 18, further comprising a writeinterface configured to write the processed fragments to the one or morebuffers.